Belokurov-Usyukina loop reduction in non-integer dimension
نویسندگان
چکیده
منابع مشابه
Fast Non-Linear Dimension Reduction
We present a fast algorithm for non-linear dimension reduction. The algorithm builds a local linear model of the data by merging PCA with clustering based on a new distortion measure. Experiments with speech and image data indicate that the local linear algorithm produces encodings with lower distortion than those built by five layer auto-associative networks. The local linear algorithm is also...
متن کاملAxiomatic basis for spaces with non integer dimension
Five structural axioms are proposed which generate a space 5 D with "dimension" D that is not restricted to the positive integers. Four of the axioms are topological; the fifth specifies an integration measure. When D is a positive integer, 5D behaves like a conventional Euclidean vector space, but nonvector character otherwise occurs. These 5 D conform to informal usage of continuously variabl...
متن کاملInteger Polynomial Optimization in Fixed Dimension
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an integer polynomial over the lattice points of a convex polytope, we show an algorithm to compute lower and upper bounds for the optimal value. For polynomials t...
متن کاملFast Integer Programming in Fixed Dimension
It is shown that the optimum of an integer program in fixed dimension with a fixed number of constraints can be computed with O(s) basic arithmetic operations, where s is the binary encoding length of the input. This improves on the quadratic running time of previous algorithms, which are based on Lenstra’s algorithm and binary search. It follows that an integer program in fixed dimension, whic...
متن کاملParametric Integer Programming in Fixed Dimension
We consider the following problem: Given a rational matrix A ∈ Qm×n and a rational polyhedron Q ⊆ Rm+p, decide if for all vectors b ∈ Rm, for which there exists an integral z ∈ Zp such that (b,z) ∈ Q, the system of linear inequalities Ax 6 b has an integral solution. We show that there exists an algorithm that solves this problem in polynomial time if p and n are fixed. This extends a result of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics of Particles and Nuclei
سال: 2013
ISSN: 1063-7796,1531-8559
DOI: 10.1134/s1063779613020135